伪线性卡尔曼滤波的观测器轨迹优化算法

单站被动式跟踪存在强非线性和弱可观测性,即便观测器的运动满足可观测性条件,滤波仍然可能发散.针对此问题,使用伪线性卡尔曼滤波器,应用费希尔信息量、罗美达下限等方法对轨迹进行优化,该优化方案避免了对目标与观测器的径距信息的近似.仿真表明:该方法与传统方法比较,计算量较小,优化得到的轨迹简单,滤波精度得到改善.最后给出了在一定条件下,观测器的"最优"运动规则.     

分层任务网络在UCAV规划中的应用

无人战斗机任务规划对提高它的生存能力、突防能力、作战效能具有重要意义.分层任务网络规划是一个有效的规划方法,HTNP的最大好处在于,搜索受控于细心设计的方法.在某种意义上讲,一个HTN规划器只描述了如何使用操作,给实际使用带来了困难.在HTNP中引入目标协调机制、禁忌表等,将原有"离线"式方法变为"在线"式方法,提高了方法的适应性能.可以根据情况的变化,随时生成新的规划,降低了预先设计方法的数量,从而降低工程实施的难度.     

浅议军校研究生科研能力的培养

培养军校研究生科研能力的意义重大,然而,目前研究生科研能力培养存在很多问题,应从更新教学理念、优化课程设计、改进教学方法和创造良好氛围等方面加强对研究生科研能力的培养。     

球约束凸二次规划的一个算法

针对球约束凸二次规划问题,利用Lagrange对偶将其转化为无约束优化问题,然后运用单纯形法对其求解,获得原问题的最优解。最后,对文中给出的算法给出了论证。     

舰载综合反潜分系统仿真训练系统构建与优化

阐述了各型反潜系统的性能、特点与组成,分析了舰载反潜武器作战过程,利用结构化设计思想构造了反潜作战仿真模型,以最新型反潜火控设备为依托,结合部队模拟训练的特点,运用创新设计理念,优化了反潜分系统界面与指挥控制流程,对仿真模拟分系统的研制具有参考价值。     

随机服务系统模型在坦克弹药保障中的应用

简要描述随机服务系统基本理论和常用数学模型。针对坦克弹药保障中两种典型的决策问题,即阵地配置方案优选和指派保障车辆数量问题,运用运筹学的方法,将其视为先到先服务的随机服务系统。在一定的简化条件下,运用三种数学模型进行系统评估,根据排队模型计算得出的一些定量指标,表明集中配置优于分散配置;并提供了完成保障任务必须的车辆指派数量。结论不仅符合实际的战场需要,而且能提出较为合理的解决方案,算法简单易行。     

Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems

Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017     

Optimal maintenance policies for a safety‐critical system and its deteriorating sensor

We consider the integrated problem of optimally maintaining an imperfect, deteriorating sensor and the safety‐critical system it monitors. The sensor's costless observations of the binary state of the system become less informative over time. A costly full inspection may be conducted to perfectly discern the state of the system, after which the system is replaced if it is in the out‐of‐control state. In addition, a full inspection provides the opportunity to replace the sensor. We formulate the problem of adaptively scheduling full inspections and sensor replacements using a partially observable Markov decision process (POMDP) model. The objective is to minimize the total expected discounted costs associated with system operation, full inspection, system replacement, and sensor replacement. We show that the optimal policy has a threshold structure and demonstrate the value of coordinating system and sensor maintenance via numerical examples. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 399–417, 2017     

采用小弹性模量方法的空间飞网构型优化设计

飞网构型设计对提高空间飞网系统的展开抓捕性能具有重要意义。用小弹性模量分析方法对空间飞网构型优化设计问题进行研究。以绳网中内力分布均衡性为优化目标,选取飞网抛射过程中最大受力时刻为研究工况,赋予绳索单元极小弹性模量,进行静力学计算,并以变形后的结果为初始条件进行迭代分析。优化结果表明,绳网中的内力分布随迭代步数的增加而更趋于均匀。在不改变绳网拓扑结构的前提下,所建立的优化设计方法为空间飞网构型优化设计提供了一种参考途径。     

基于族群机制的花朵授粉算法

针对花朵授粉算法易陷入局部极值、收敛速度慢等不足,提出一种具有族群机制的花朵授粉算法。该算法把种群分成多个族群,各族群的最优个体再组成新的种群,进而促进种群间的信息交流,有效地协调种群进化过程中的全局搜索和局部搜索能力,避免个体的早熟收敛,提高算法的全局寻优能力及收敛速度。通过8个CEC2005benchmark测试函数进行测试比较,仿真结果表明,改进算法的寻优性能明显优于基本的花朵授粉算法、粒子群算法和蝙蝠算法,其收敛精度、收敛速度、鲁棒性均较对比算法有较大提高。